全文获取类型
收费全文 | 3650篇 |
免费 | 141篇 |
国内免费 | 146篇 |
学科分类
工业技术 | 3937篇 |
出版年
2024年 | 4篇 |
2023年 | 22篇 |
2022年 | 30篇 |
2021年 | 55篇 |
2020年 | 45篇 |
2019年 | 52篇 |
2018年 | 64篇 |
2017年 | 98篇 |
2016年 | 89篇 |
2015年 | 168篇 |
2014年 | 215篇 |
2013年 | 279篇 |
2012年 | 246篇 |
2011年 | 306篇 |
2010年 | 192篇 |
2009年 | 273篇 |
2008年 | 290篇 |
2007年 | 266篇 |
2006年 | 242篇 |
2005年 | 188篇 |
2004年 | 142篇 |
2003年 | 138篇 |
2002年 | 104篇 |
2001年 | 54篇 |
2000年 | 43篇 |
1999年 | 50篇 |
1998年 | 49篇 |
1997年 | 39篇 |
1996年 | 26篇 |
1995年 | 28篇 |
1994年 | 21篇 |
1993年 | 11篇 |
1992年 | 6篇 |
1991年 | 12篇 |
1990年 | 10篇 |
1989年 | 12篇 |
1988年 | 5篇 |
1987年 | 7篇 |
1986年 | 12篇 |
1985年 | 7篇 |
1984年 | 10篇 |
1982年 | 9篇 |
1981年 | 5篇 |
1980年 | 2篇 |
1978年 | 2篇 |
1976年 | 3篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1971年 | 1篇 |
1958年 | 1篇 |
排序方式: 共有3937条查询结果,搜索用时 31 毫秒
1.
Against the background of smart manufacturing and Industry 4.0, how to achieve real-time scheduling has become a problem to be solved. In this regard, automatic design for shop scheduling based on hyper-heuristics has been widely studied, and a number of reviews and scheduling algorithms have been presented. Few studies, however, have specifically discussed the technical points involved in algorithm development. This study, therefore, constructs a general framework for automatic design for shop scheduling strategies based on hyper-heuristics, and various state-of-the-art technical points in the development process are summarized. First, we summarize the existing types of shop scheduling strategies and classify them using a new classification method. Second, we summarize an automatic design algorithm for shop scheduling. Then, we investigate surrogate-assisted methods that are popular in the current algorithm field. Finally, current problems and challenges are discussed, and potential directions for future research are proposed. 相似文献
2.
This paper considers the scheduling problem of minimizing earliness–tardiness (E/T) on a single batch processing machine with a common due date. The problem is extended to the environment of non-identical job sizes. First, a mathematical model is formulated, which is tested effectively under IBM ILOG CPLEX using the constraint programming solver. Then several optimal properties are given to schedule batches effectively, and by introducing the concept of ARB (Attribute Ratio of Batch), it is proven that the ARB of each batch should be made as small as possible in order to minimize the objective, designed as the heuristic information for assigning jobs into batches. Based on these properties, a heuristic algorithm MARB (Minimum Attribute Ratio of Batch) for batch forming is proposed, and a hybrid genetic algorithm is developed for the problem under study by combining GA (genetic algorithm) with MARB. Experimental results demonstrate that the proposed algorithm outperforms other algorithms in the literature, both for small and large problem instances. 相似文献
3.
A steelmaking-continuous casting (SCC) scheduling problem is an example of complex hybrid flow shop scheduling problem (HFSSP) with a strong industrial background. This paper investigates the SCC scheduling problem that involves controllable processing times (CPT) with multiple objectives concerning the total waiting time, earliness/tardiness and adjusting cost. The SCC scheduling problem with CPT is seldom discussed in the existing literature. This study is motivated by the practical situation of a large integrated steel company in which the just-in-time (JIT) and cost-cutting production strategy have become a significant concern. To address this complex HFSSP, the scheduling problem is decomposed into two subproblems: a parallel machine scheduling problem (PMSP) in the last stage and an HFSSP in the upstream stages. First, a hybrid differential evolution (HDE) algorithm combined with a variable neighborhood decomposition search (VNDS) is proposed for the former subproblem. Second, an iterative backward list scheduling (IBLS) algorithm is presented to solve the latter subproblem. The effectiveness of this bi-layer optimization approach is verified by computational experiments on well-designed and real-world scheduling instances. This study provides a new perspective on modeling and solving practical SCC scheduling problems. 相似文献
4.
A mathematical model for open pit mine production scheduling with Grade Engineering® and stockpiling
《矿业科学技术学报(英文版)》2021,31(4):717-728
This paper presents the development and implementation of an innovative mixed integer programming based mathematical model for an open pit mining operation with Grade Engineering framework. Grade Engineering comprises a range of coarse-separation based pre-processing techniques that separate the desirable (i.e. high-grade) and undesirable (i.e. low-grade or uneconomic) materials and ensure the delivery of only selected quantity of high quality (or high-grade) material to energy, water, and cost-intensive processing plant. The model maximizes the net present value under a range of operational and processing constraints. Given that the proposed model is computationally complex, the authors employ a data pre-processing procedure and then evaluate the performance of the model at several practical instances using computation time, optimality gap, and the net present value as valid measures. In addition, a comparison of the proposed and traditional (without Grade Engineering) models reflects that the proposed model outperforms the traditional formulation. 相似文献
5.
6.
We study a two-agent scheduling problem in a two-machine permutation flowshop with learning effects. The objective is to minimize the total completion time of the jobs from one agent, given that the maximum tardiness of the jobs from the other agent cannot exceed a bound. We provide a branch-and-bound algorithm for the problem. In addition, we present several genetic algorithms to obtain near-optimal solutions. Computational results indicate that the algorithms perform well in either solving the problem or efficiently generating near-optimal solutions. 相似文献
7.
A new matching cost computation method based on nonsubsampled contourlet transform (NSCT) for stereo image matching is proposed in this paper. Firstly, stereo image is decomposed into high frequency sub-band images at different scales and along different directions by NSCT. Secondly, by utilizing coefficients in high frequency domain and grayscales in RGB color space, the computation model of weighted matching cost between two pixels is designed based on the gestalt laws. Lastly, two types of experiments are carried out with standard stereopairs in the Middlebury benchmark. One of the experiments is to confirm optimum values of NSCT scale and direction parameters, and the other is to compare proposed matching cost with nine known matching costs. Experimental results show that the optimum values of scale and direction parameters are respectively 2 and 3, and the matching accuracy of the proposed matching cost is twice higher than that of traditional NCC cost. 相似文献
8.
一类Feistel密码的线性分析 总被引:5,自引:0,他引:5
该文提出一种新的求取分组密码线性偏差上界的方法,特别适用于密钥线性作用的Feistel密码.该分析方法的思路是,首先对密码体制线性偏差进行严格的数学描述,分别给出密码线性偏差与轮函数F及S盒的线性偏差的数学关系;然后通过求取线性方程组最小重量解,确定密码线性偏差的上界. 相似文献
9.
This paper addresses the problem of power control in a multihop wireless network supporting multicast traffic. We face the problem of forwarding packet traffic to multicast group members while meeting constraints on the signal-to-interference-plus-noise ratio (SINR) at the intended receivers. First, we present a distributed algorithm which, given the set of multicast senders and their corresponding receivers, provides an optimal solution when it exists, which minimizes the total transmit power. When no optimal solution can be found for the given set of multicast senders and receivers, we introduce a distributed, joint scheduling and power control algorithm which eliminates the weak connections and tries to maximize the number of successful multicast transmissions. The algorithm allows the other senders to solve the power control problem and minimize the total transmit power. We show that our distributed algorithm converges to the optimal solution when it exists, and performs close to centralized, heuristic algorithms that have been proposed to address the joint scheduling and power control problem. 相似文献
10.
We consider the problem of rescheduling trains in the case where one track of a railway section consisting of two tracks
in opposing directions is closed due to construction activities. After presenting an appropriate model for this situation
we derive a polynomial algorithm for the subproblem of finding an optimal schedule with minimal latenesss if the subsequences
of trains for both directions outside the construction site are fixed. Based on this algorithm we propose a local search procedure
for the general problem of finding good schedules and report test results for some real world instances.
Received: December 8, 1999 / Accepted: May 2, 2001 相似文献